Classification of Finite Metric Spaces and Combinatorics of Convex Polytopes
نویسنده
چکیده
We describe the canonical correspondence between finite metric spaces and symmetric convex polytopes, and formulate the problem about classification of the metric spaces in terms of combinatorial structure of those polytopes.
منابع مشابه
Drawing polytopal graphs with polymake
This note wants to explain how to obtain meaningful pictures of (possibly high-dimensional) convex polytopes, triangulated manifolds, and other objects from the realm of geometric combinatorics such as tight spans of finite metric spaces and tropical polytopes. In all our cases we arrive at specific, geometrically motivated, graph drawing problems. The methods displayed are implemented in the s...
متن کاملConvexity and Geodesic Metric Spaces
In this paper, we first present a preliminary study on metric segments and geodesics in metric spaces. Then we recall the concept of d-convexity of sets and functions in the sense of Menger and study some properties of d-convex sets and d-convex functions as well as extreme points and faces of d-convex sets in normed spaces. Finally we study the continuity of d-convex functions in geodesic metr...
متن کاملOn new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces
In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.
متن کاملComposition of resolvents and quasi-nonexpansive multivalued mappings in Hadamared spaces
The proximal point algorithm, which is a well-known tool for finding minima of convex functions, is generalized from the classical Hilbert space framework into a nonlinear setting, namely, geodesic metric spaces of nonpositive curvature. In this paper we propose an iterative algorithm for finding the common element of the minimizers of a finite family of convex functions a...
متن کاملCombinatorics of sections of polytopes and Coxeter groups in Lobachevsky spaces
Coxeter classified all discrete isometry groups generated by reflections that act on a Euclidean space or on a sphere of an arbitrary dimension (see [1]). His fundamental work became classical long ago. Lobachevsky spaces (classical hyperbolic spaces) are as symmetric as Euclidean spaces and spheres. However, discrete isometry groups generated by reflections, with fundamental polytopes of finit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015